Flocking of Multi-Agent Systems with Limited Rotating Field of Views

نویسندگان

  • Mohammad Mehdi Asadi
  • Amir G. Aghdam
چکیده

In this paper, the flocking problem in a network of double-integrator agents with limited angular fields of view (FOV) is investigated. The angular FOV represents the limitation imposed on the velocity sensor mounted on every agent in the network, while the position sensors are assumed to be omnidirectional. To increase the sensing capabilities of agents and preserve network connectivity, it is assumed that the FOV of all agents rotate with constant angular velocity. The problem is formulated in the framework of switched nonlinear systems to address the switching topology of the network. The control inputs are subsequently designed as a combination of alignment and attractive/repulsive forces, such that the velocity vectors reach consensus and the inter-agent collision is avoided. The asymptotic convergence of the network configuration is guaranteed under the proposed controller. Simulations confirm the efficacy of the controller.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable Structure Behavioural Controller for Multi-agent Systems

In previous papers authors have considered agents as inertia-less self driven particles and designed a flocking algorithm. Application of this algorithm to agents with considerable inertial characteristics needs a behavioural controller. The controller uses the local information and helps every agent to imitate the desired behaviour as a member of the flocking frame which covers the main is...

متن کامل

Finite-time Flocking of Multi-agent System with Input Saturation

In this paper a finite-time flocking of multi-agent system with input saturation is investigated. By introducing a new control protocol, it is show that speed and position of agents with double-integrator dynamics converge to the speed and position of leader in finite time. It is assumed that the graph between the agents is connected and that at least one agent is informed of the leader speed a...

متن کامل

A flocking algorithm for multi-agent systems with connectivity preservation under hybrid metric-topological interactions

In this paper, we propose a connectivity-preserving flocking algorithm for multi-agent systems in which the neighbor set of each agent is determined by the hybrid metric-topological distance so that the interaction topology can be represented as the range-limited Delaunay graph, which combines the properties of the commonly used disk graph and Delaunay graph. As a result, the proposed flocking ...

متن کامل

Dynamical Flocking of Multi-agent Systems with Multiple Leaders and Uncertain Parameters

Dynamical flocking of multi-agent systems with multiple leaders is studied. Supposing topologies are dynamically changed with jointly-connected, flocking algorithm of multi-agent systems with time-varying delays is proposed. Multi-agent systems with uncertain parameters and time-varying delays is investigated, and sufficient conditions are given for flocking control of multi-agent systems with ...

متن کامل

Flocking of Discrete-time Multi-Agent Systems with Predictive Mechanisms

For decades, scientists from various fields have been fascinated by flocking behavior for its wide engineering applications. Inspired by the predictive intelligence of bio-groups, in this paper we design a novel discrete-time model predictive control based flocking protocol, and investigate the role of predictive mechanisms in flocking of multi-agent systems by using mathematical analyses and n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013